Selected topics in approximation and computation
نویسندگان
چکیده
Change your habit to hang or waste the time to only chat with your friends. It is done by your everyday, don't you feel bored? Now, we will show you the new habit that, actually it's a very old habit to do that can make your life more qualified. When feeling bored of always chatting with your friends all free time, you can find the book enPDF selected topics in approximation and computation and then read it.
منابع مشابه
Homotopy approximation of modules
Deleanu, Frei, and Hilton have developed the notion of generalized Adams completion in a categorical context. In this paper, we have obtained the Postnikov-like approximation of a module, with the help of a suitable set of morphisms.
متن کاملModified Physical Optics Approximation for RCS Calculation of Electrically Large Objects with Coated Dielectric
The Radar Cross Section of a target plays an important role in the detection of targets by radars. This paper presents a new method to predict the bistatic and monostatic RCS of coated electrically large objects. The bodies can be covered by lossy electric and/or magnetic Radar Absorbing Materials (RAMs). These materials can be approximated by the Fresnel reflection coefficients. The pro...
متن کاملWidth invariant approximation of fuzzy numbers
In this paper, we consider the width invariant trapezoidal and triangularapproximations of fuzzy numbers. The presented methods avoid the effortful computation of Karush-Kuhn-Tucker Theorem. Some properties of the new approximation methods are presented and the applicability of the methods is illustrated by examples. In addition, we show that the proposed approximations of fuzzy numbers preserv...
متن کاملEfficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملTopics in computational algebraic number theory par
We describe practical algorithms from computational algebraic number theory, with applications to class field theory. These include basic arithmetic, approximation and uniformizers, discrete logarithms and computation of class fields. All algorithms have been implemented in the Pari/Gp system.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995